磁偶极子信号检测和参数估计

在分析了经典磁偶极子模型的基础上 ,指出该模型是两个函数的组合 ,目标参数包含在这两个函数的参数里 .提出了二次函数组合法 ,能够在绝大多数情况下将这两个函数分离 ,逐步求出目标参数 .最后对实例进行了仿真计算 ,给出了较满意的结果     

拖缆系统回转运动仿真计算

用三因次拖缆系统动力平衡运动方程式 ,在时间和空间上作中心差分数值离散平衡方程式 ,编制了拖缆回转运动计算程序 .在拖缆尾端自由边界条件中 ,将尾绳阻力作为自由尾端点的张力 ,改善了因自由尾端张力为零引起的差分方程奇异性 ,使仿真计算更加稳定 .将阵形坐标值转换到拖点运动坐标系中 ,便于拖船观察回转机动中阵形的变化 .仿真计算了两个拖曳阵试验模型 ,仿真结果与试验比较吻合较好 .对实尺寸拖曳线列阵进行了仿真计算 ,讨论了拖点速度和回转半径对阵形影响     

一种慢波自由电子激光的动力学理论分析

本文用动力学耦合模理论,研究在矩形波导中单侧填充介质而形成的慢波线极化自由电子激光的特性。结果表明,在这一系统中,可用低能电子束产生高频率高增益的自由电子激光,并具有极宽的调谐域。     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

基于线特征的多时相遥感图像变化检测

多时相遥感图像中利用线特征可以感知道路等线形地物的变化。论文提出一种新的基于边缘特征描述的线特征变化检测算法,首先根据边缘的梯度信息得到变化边缘,并对变化边缘进行编组,形成变化边缘的直线支撑区域,然后通过最小二乘拟合方法从直线支撑区域中提取出变化直线。提出的线特征变化检测算法把边缘的相位和幅度信息作为变化检测的判定依据,从而避免了线的匹配与比较工作,降低了变化检测的算法复杂度,具有很强的实用性。将提出的方法用于多时相遥感图像变化检测,实验结果显示该方法的有效性。     

Note: Two rendezvous search problems on the line

A new upper bound is obtained for the two‐person symmetric rendezvous value on the real line when the distribution function of their initial distance apart is bounded. A second result shows that if three players are placed randomly on adjacent integers on the real line facing in random directions and able to move at a speed of at most 1, then they can ensure a three‐way meeting time of at most 7/2; the fact that 7/2 is a best possible result follows from work already in the literature. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 335–340, 1999     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

Attrition models of the Ardennes campaign

This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998     

等值电路法列写线性网络的状态方程

本文介绍一种手算时用等值电路编写线性网络状态方程的方法。优点是不必列任何方程式,尤其是可以省略消去非状态变量的复杂计算过程。提出一种用检查“量纲”的办法,核对计算是否有误,以便及时纠正。     

整数线性规划问题的一个新算法

本文给出求解整数线性规划问题的一个算法。基本思想是通过求出其伴随线性规划问题的最优单纯形表,把整数线性规划化成正整数系数的不定方程,然后从不定方程的非负整数解集中选取一组满足整数线性规划的约束条件的解,作为整数线性规划的最优解。